CENTRO DE INVESTIGACIÓN ECONÓMICA Discussion Papers Series Vote Revelation: Empirical Characterization of Scoring Rules

نویسنده

  • Andrei Gomberg
چکیده

In this paper I consider choice correspondences defined on an extended domain: the decisions are assumed to be taken not by individuals, but by committees and, in addition to the budget sets, committee composition is observable and variable. For the case of varying committees choosing over a fixed set of two alternatives I provide a full characterization of committee choice structures that may be rationalized with sincere scoring. For the general case of multiple alternatives a necessary implication of choice by sincere scoring is provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of SiO2-TiO2 Coatings on 316l Stainless Steel Substrates

This paper reports nano-structured SiO2-TiO2 coatings using the sol-gel technique on 316L steel substrates. Nanoindentation, surface analysis and corrosion resistance tests were performed on different samples. The nanomechanical tests allowed to compare uncoated steel samples (Eavg = 193.24 GPa and mean hardness of 2.63 GPa and coated steel samples (Eavg = 287.38 GPa and mean hardness of 5.74 G...

متن کامل

On the Axiomatic Characterization of Runoff Voting Rules

Runoff voting rules such as single transferable vote (STV) and Baldwin’s rule are of particular interest in computational social choice due to their recursive nature and hardness of manipulation, as well as in (human) practice because they are relatively easy to understand. However, they are not known for their compliance with desirable axiomatic properties, which we attempt to rectify here. We...

متن کامل

The Axiomatic Characterizations of Majority Voting and Scoring Rules

résumé – Les caractérisations axiomatiques du vote majoritaire et des classements par points. Le cadre arrowien de la théorie des choix collectifs est suffisament flexible pour entreprendre une étude axiomatique précise des règles de vote qui sont communément utilisées dans des élections politiques, lors de compétitions sportives ou par des comités d’experts etc. comme le vote à la majorité ou ...

متن کامل

The Computational Impact of Partial Votes on Strategic Voting

In many real world elections, agents are not required to rank all candidates. We study three of the most common methods used to modify voting rules to deal with such partial votes. These methods modify scoring rules (like the Borda count), elimination style rules (like single transferable vote) and rules based on the tournament graph (like Copeland) respectively. We argue that with an eliminati...

متن کامل

A $O(\log m)$, deterministic, polynomial-time computable approximation of Lewis Carroll's scoring rule

We provide deterministic, polynomial-time computable voting rules that approximate Dodgson’s and (the “minimization version” of) Young’s scoring rules to within a logarithmic factor. Our approximation of Dodgson’s rule is tight up to a constant factor, as Dodgson’s rule is NP-hard to approximate to within some logarithmic factor. The “maximization version” of Young’s rule is known to be NP-hard...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011